Pressure Flow–Based Algorithms for Pressure-Driven Analysis of Water Distribution Networks

In recent years, pressure-driven analyses of water distribution systems using pressure-flow relationships (PFRs) were shown to be more computationally efficient than those based on flow-pressure (FPRs), such as the widely used Wagner equation and various spline approximations. Using a PFR enhances convergence properties Newton–Raphson method by most network (WDN) solvers. This paper derives new way incorporating into classical Todini Pilati global gradient algorithm (GGA). The resulting solution are compared with from two other existing algorithms, EPANET 2.2 active-set (ASM), well conventional flow-pressure–based number different networks varying size.